Applying Colored-Graph Isomorphism for Electrical Circuit Matching in Circuit Repository
نویسندگان
چکیده
In electrical engineering educational industrial applications it is often required for the students to build and analyze well-known circuits according to their syllabus. In this paper a colored graph isomorphism based model is discussed that is being developed to match two electrical circuits. The procedure involves two steps, first being, to store the circuit in the data base in form of a colored graph and then matching users input circuit with it using graph isomorphism. Since graph isomorphism is in NP, it has no known polynomial time solution. However, in this particular problem of circuits, the colors and weight used in the nodes vary and the graphs generated are sparsely connected. Thus the algorithm runs in a reasonable time.
منابع مشابه
SubHunter: a high-performance and scalable sub-circuit recognition method with Prüfer-encoding
Sub-circuit recognition (SR) is a problem of recognizing sub-circuits within a given circuit and is a fundamental component in simulation, verification and testing of computeraided design. The SR problem can be formulated as subgraph isomorphism problem. Performance of previous works is not scalable as the complexities of modern designs increase. In this paper we propose a novel Prüfer-encoding...
متن کاملDesign of an S-band Ultra-low-noise Amplifier with Frequency Band Switching Capability
In this paper, an ultra-low-noise amplifier with frequency band switching capability is designed, simulated and fabricated. The two frequency ranges of this amplifier consist of the 2.4 to 2.5 GHz and 3.1 GHz to 3.15 GHz frequency bands. The designed amplifier has a noise figure of less than 1dB, a minimum gain of 23 dB and a VSWR of less than 2 in the whole frequency band. The design process s...
متن کاملSome Results in Circuit Complexity
The thesis consists of three parts. The first part investigates the AC complexity of subgraph isomorphism problem that is, detecting whether an n-vertex input graph contains a P -subgraph for some fixed P . For the average-case complexity, where the input is a distribution on random graphs at the threshold and small error is allowed, we are able to explicitly characterize the minimal AC size up...
متن کاملDesign of a Single-Layer Circuit Analog Absorber Using Double-Circular-Loop Array via the Equivalent Circuit Model
A broadband Circuit Analogue (CA) absorber using double-circular-loop array is investigated in this paper. A simple equivalent circuit model is presented to accurately analyze this CA absorber. The circuit simulation of the proposed model agrees well with full-wave simulations. Optimization based the equivalent circuit model, is applied to design a single-layer circuit analogue absorber using d...
متن کاملSurvey of Graph Matching Algorithms
Graph matching problems of varying types are important in a wide array of application areas. A graph matching problem is a problem involving some form of comparison between graphs. Some of the many application areas of such problems include information retrieval, sub-circuit identification, chemical structure classification, and networks. Problems of efficient graph matching arise in any field ...
متن کامل